Deterministic Equivalents for Certain Functionals of Large Random Matrices1 by Walid Hachem,
نویسندگان
چکیده
Consider an N×n random matrix Yn = (Y n ij ) where the entries are given by Y ij = σij (n) √ n X ij , the X n ij being independent and identically distributed, centered with unit variance and satisfying some mild moment assumption. Consider now a deterministic N × n matrix An whose columns and rows are uniformly bounded in the Euclidean norm. Let n = Yn +An. We prove in this article that there exists a deterministic N × N matrix-valued function Tn(z) analytic in C−R+ such that, almost surely,
منابع مشابه
On bilinear forms based on the resolvent of large random matrices
Consider a N × n non-centered matrix Σn with a separable variance profile: Σn = D 1/2 n XnD̃ 1/2 n √ n + An . Matrices Dn and D̃n are non-negative deterministic diagonal, while matrix An is deterministic, and Xn is a random matrix with complex independent and identically distributed random variables, each with mean zero and variance one. Denote by Qn(z) the resolvent associated to ΣnΣ∗n, i.e. Qn(...
متن کاملA CLT for information-theoretic statistics of non-centered Gram random matrices
In(ρ) = 1 N log det (ΣnΣ ∗ n + ρIN ) , (ρ > 0) where Σn = n−1/2D 1/2 n XnD̃ 1/2 n + An, as the dimensions of the matrices go to infinity at the same pace. Matrices Xn and An are respectively random and deterministic N ×n matrices; matrices Dn and D̃n are deterministic and diagonal, with respective dimensions N×N and n×n; matrixXn = (Xij) has centered, independent and identically distributed entri...
متن کاملDeterministic Equivalents for Certain Functionals of Large Random Matrices
Abstract. Consider a N × n random matrix Yn = (Y n ij ) where the entries are given by Y n ij = σij(n) √ n X ij , the X n ij being independent and identically distributed, centered with unit variance and satisfying some mild moment assumption. Consider now a deterministic N×n matrix An whose columns and rows are uniformly bounded for the Euclidean norm. Let Σn = Yn + An. We prove in this articl...
متن کاملMMSE analysis of certain large isometric random precoded systems
Linear Precoding consists in multiplying by a N K matrix a K-dimensional vector obtained by serial to parallel conversion of a symbol sequence to be transmitted. In this paper, we analyse the performance of MMSE receivers for certain large random isometric precoded systems on fading channels. Using new tools, borrowed from the so-called Free Probability Theory, it can be shown that the Signal t...
متن کاملSur les fluctuations de l’information mutuelle des canaux MIMO de grandes dimensions
In this article, large random matrix theory is used to study Shannon’s mutual information of a general class of MIMO (“Multiple Input Multiple Output”) radio channels with random correlated gains. In the literature there exists an approximation of this mutual information in the asymptotic regime where the number of transmitting antennas and the number of receiving antennas grow toward infinity ...
متن کامل